Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

He-Ne激光诱变的香菇变异株遗传稳定性分析

对三株香菇菌种采用He-Ne激光(λ=6328nm)进行两次照射,筛选出三株比出发菌株菌丝生长速率分别提高173%、737%和426%的变异株,经传代培养及酯酶同工酶谱分析,变异株具有良好的遗传稳定性表明激光作为微生物新型诱变因子与传统化因子相比,具有正变率高、回复突变率低、遗传稳定性好的特点.     

一个(2+1)维的可积sinb-Gordon方程

利用ｍＫｄＶ方程的违推算子的遗传性，构造了一个（２＋１）维的ｓｉｎｈ－Ｇｏｒｄｏｎ型的可积模型。该模型是（１＋１）维ｓｉｎｈ－Ｇｏｒｄｏｎ方程的推广．同时给出了该模型丰富的对称性及其相应的代数结构。     

The representations of nested composition algebras

In this paper, we investigate the basis graph of the monoid algebra of a submonoid of the monoid of mappings from N = {1,…,n} to itself, defined by a nested sequence of compositions of N. Each such monoid is a left regular band (LRB), that is, a semigroup S satisfying x² = x and xyx = xy for all x,y∈S. This class is su?ciently rich that every path algebra of an acyclic quiver can be embedded in such a monoid algebra. The multiplication in the monoid algebra has a particularly simple quasi-multiplicative form, allowing definition over the integers. Combining this with a formula for Ext-groups for LRBs due to Margolis et al. [6 Margolis, S., Saliola, F., Steinberg, B. (2015). Combinatorial topology and the global dimension of algebras arising in combinatorics. J. Eur. Math Soc. 17(12):3037–3080.[Crossref], [Web of Science ®] , [Google Scholar]], we get a simple criterion for the nested composition algebras to be hereditary.     

Bounded state problem for hereditary control problems

In this paper, we characterize optimal pairs for a hereditary control problem where the state is constrained. We use relaxed controls and the technique of penalization.This research was supported by NSF Grant No. HRD-91-54077.     

On the strong p-Helly property

The notion of strong p-Helly hypergraphs was introduced by Golumbic and Jamison in 1985 [M.C. Golumbic, R.E. Jamison, The edge intersection graphs of paths in a tree, J. Combin. Theory Ser. B 38 (1985) 8-22]. Independently, other authors [A. Bretto, S. Ubéda, J. ?erovnik, A polynomial algorithm for the strong Helly property. Inform. Process. Lett. 81 (2002) 55-57, E. Prisner, Hereditary clique-Helly graphs, J. Combin. Math. Combin. Comput. 14 (1993) 216-220, W.D. Wallis, Guo-Hui Zhang, On maximal clique irreducible graphs. J. Combin. Math. Combin. Comput. 8 (1990) 187-193.] have also considered the strong Helly property in other contexts. In this paper, we characterize strong p-Helly hypergraphs. This characterization leads to an algorithm for recognizing such hypergraphs, which terminates within polynomial time whenever p is fixed. In contrast, we show that the recognition problem is co-NP-complete, for arbitrary p. Further, we apply the concept of strong p-Helly hypergraphs to the cliques of a graph, leading to the class of strong p-clique-Helly graphs. For p=2, this class is equivalent to that of hereditary clique-Helly graphs [E. Prisner, Hereditary clique-Helly graphs, J. Combin. Math. Combin. Comput. 14 (1993) 216-220]. We describe a characterization for this class and obtain an algorithm for recognizing such graphs. Again, the algorithm has polynomial-time complexity for p fixed, and we show the corresponding recognition problem to be NP-hard, for arbitrary p.     

Identification of patients with hereditary haemochromatosis by magnetic resonance imaging and spectroscopic relaxation time measurements

A total of 4302 healthy blood donors were screened for elevated serum ferritin and transferrin saturation. Fifteen had increased serum ferritin at a follow-up examination. Five relatives of these donors also entered the study. Eleven patients had elevated liver iron concentrations, while five had normal liver iron concentrations. The R₂ relaxation rate in the liver was first measured with a conventional multi-spin-echo imaging sequence, and then by a volume-selective spectroscopic multi-spin-echo sequence, in order to achieve a minimum echo time of 4 msec. No correlation was found between the relaxation rate R₂ and the liver iron concentration, when R₂ was calculated from the imaging data. Multi-exponential transverse relaxation could be resolved when the spectroscopic sequence was used. A strong correlation between the initial slope of the relaxation curve and the liver iron concentration was found (r = 0.90, p < 0.001). Signal intensity ratios between liver and muscle were calculated from the first three echoes in the multi-echo imaging sequence, and from a gradient echo sequence. A strong correlation between the logarithm of the signal intensity ratios and the liver iron concentration was found. Although both spectroscopic T₂ relaxation time measurements and signal intensity ratios could be used to quantify liver iron concentration, the gradient echo imaging seemed to be the best choice. Gradient echo imaging could be performed during a single breath hold, so motion artifacts could be avoided. The accuracy of liver iron concentration estimates from signal intensity ratios in the gradient echo images was about 35%.     

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs

Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269-277]. In this work, we consider the decision problems: given a graph G=(V,E) and an integer k≥0, we ask whether there exists a subset V^′⊆V with |V^′|≥k such that the induced subgraph G[V^′] of G is, variously, a clique, clique-Helly or hereditary clique-Helly graph. The first problem is clearly NP-complete, from the above reference; we prove that the other two decision problems mentioned are NP-complete, even for maximum degree 6 planar graphs. We consider the corresponding maximization problems of finding a maximum induced subgraph that is, respectively, clique, clique-Helly or hereditary clique-Helly. We show that these problems are Max SNP-hard, even for maximum degree 6 graphs. We show a general polynomial-time -approximation algorithm for these problems when restricted to graphs with fixed maximum degree Δ. We generalize these results to other graph classes. We exhibit a polynomial 6-approximation algorithm to minimize the number of vertices to be removed in order to obtain a hereditary clique-Helly subgraph.